An Explicit Parametrization of Closed Loops for Spatially Distributed Controllers With Sparsity Constraints
نویسندگان
چکیده
In this article,we study the linear time-invariant state-feedback controller design problem for distributed systems. We follow recently developed system level synthesis (SLS) approach and impose locality structure on resulting closed-loop mappings; corresponding implementation inherits prescribed structure. contrast to existing SLS results, we derive an explicit (rather than implicit) parameterization of all achievable stabilized closed-loops. This admits more efficient IIR representations temporal part dynamics, it allows $\mathcal {H}_2$ with spatial sparsity constraints be converted a standard model matching problem, number transfer function parameters scaling linearly extent constraint. illustrate our results two applications: consensus first-order subsystems vehicular platoons problem. case consensus, provide analytic solutions further analyze architecture implementation. Results infinite spatially invariant systems are presented insight large but finite subsystems.
منابع مشابه
Parametrization of Stabilizing Controllers with Fixed Precompensators
In the framework of the factorization approach, we give a parameterization of a class of stabilizing controllers. This class is characterized by some fixed strictly causal precompensators. As applications, we present the parameterization of all causal stabilizing controllers including the some fixed number or more integrators, and the parameterization of all strictly causal stabilizing controll...
متن کاملTrading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the resulting optimization problem is generally NP-hard, several approximation algorithms are considered. We analyze the performance of these algorithms, focusing on the characterization of the trade-off between accuracy a...
متن کاملAn Iterative Algorithm with Joint Sparsity Constraints for Magnetic Tomography
Magnetic tomography is an ill-posed and ill-conditioned inverse problem since, in general, the solution is non-unique and the measured magnetic field is affected by high noise. We use a joint sparsity constraint to regularize the magnetic inverse problem. This leads to a minimization problem whose solution can be approximated by an iterative thresholded Landweber algorithm. The algorithm is pro...
متن کاملConvergence rates for regularization with sparsity constraints
Tikhonov regularization with p-powers of the weighted `p norms as penalties, with p ∈ (1, 2), have been lately employed in reconstruction of sparse solutions of ill-posed inverse problems. This paper points out convergence rates for such a regularization with respect to the norm of the weighted spaces, by assuming that the solutions satisfy certain smoothness (source) condition. The meaning of ...
متن کاملPreserving Positivity for Matrices with Sparsity Constraints
Functions preserving Loewner positivity when applied entrywise to positive semidefinite matrices have been widely studied in the literature. Following the work of Schoenberg [Duke Math. J. 9], Rudin [Duke Math. J. 26], and others, it is well-known that functions preserving positivity for matrices of all dimensions are absolutely monotonic (i.e., analytic with nonnegative Taylor coefficients). I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2022
ISSN: ['0018-9286', '1558-2523', '2334-3303']
DOI: https://doi.org/10.1109/tac.2021.3111863